By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 24, Issue 1, pp. 1-201

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

In Memoriam: Eugene L. Lawler

pp. 1-2

Matrix Transformation Is Complete for the Average Case

Andreas Blass and Yuri Gurevich

pp. 3-29

Tighter Lower Bounds on the Exact Complexity of String Matching

Richard Cole, Ramesh Hariharan, Mike Paterson, and Uri Zwick

pp. 30-45

Planar Strong Connectivity Helps in Parallel Depth-First Search

Ming-Yang Kao

pp. 46-62

Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices

Dario Bini and Luca Gemignani

pp. 63-77

A Graph-Theoretic Game and Its Application to the $k$-Server Problem

Noga Alon, Richard M. Karp, David Peleg, and Douglas West

pp. 78-100

Finding $k$ Cuts within Twice the Optimal

Huzur Saran and Vijay V. Vazirani

pp. 101-108

The Serial Transitive Closure Problem for Trees

Maria Luisa Bonet and Samuel R. Buss

pp. 109-122

New Decidability Results Concerning Two-Way Counter Machines

Oscar H. Ibarra, Tao Jiang, Nicholas Tran, and Hui Wang

pp. 123-137

On the Optimality of Randomized $\alpha$-$\beta$ Search

Yanjun Zhang

pp. 138-147

Greedy Packet Scheduling

Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg

pp. 148-157

Optimal File Sharing in Distributed Networks

Moni Naor and Ron M. Roth

pp. 158-183

An Optimal Algorithm for Computing Visibility in the Plane

Paul J. Heffernan and Joseph S. B. Mitchell

pp. 184-201